Diffie–Hellman problem - PDFSEARCH.IO - Document Search Engine

Diffie–Hellman problem
Results: 86

#	Item
21	Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS Seung Geol Choi∗ Jonathan Katz† Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2014-05-14 14:54:31 Ciphertext indistinguishability Oblivious transfer Computational indistinguishability Cryptographic hash function Chosen-ciphertext attack Zero-knowledge proof Diffie–Hellman problem RSA Cryptography Cryptographic protocols Common reference string model
22	Irreducibility to the One-More Evaluation Problems: More May Be Less Daniel R. L. Brown∗ June 9, 2010 Abstract Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2010-06-09 14:57:08 Finite fields Computability theory Cryptographic protocols Computational complexity theory Diffie–Hellman problem XTR Random self-reducibility Oracle machine Reduction Theoretical computer science Applied mathematics Mathematics
23	Improvement of Ma ni ke ta l . Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2005-12-09 05:56:33 Computational hardness assumptions Diffie–Hellman key exchange Diffie–Hellman problem Weil pairing ID-based encryption Password authentication protocol Public-key cryptography Boneh/Franklin scheme Cryptography Cryptographic protocols Finite fields
24	Concurrent Blind Signatures without Random Oracles∗ Aggelos Kiayias† Hong-Sheng Zhou† Abstract Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2006-05-20 02:15:48 Blind signature Group signature ElGamal encryption RSA Paillier cryptosystem XTR Diffie–Hellman problem Homomorphic encryption Commitment scheme Cryptography Public-key cryptography Digital signature
25	Chapter 10 Number-Theoretic Primitives Number theory is a source of several computational problems that serve as primitives in the design of cryptographic schemes. Asymmetric cryptography in particular relies on these pr Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2009-09-20 23:35:30 Group theory Finite fields Computational hardness assumptions Logarithms Discrete logarithm Diffie–Hellman problem Baby-step giant-step Elliptic curve Diffie–Hellman key exchange Abstract algebra Cryptography Mathematics
26	Appears in P. Samarati, P. Ryan, D. Gollmann, R. Molva (Eds.): Computer Security – ESORICS 2004, Springer-Verlag LNCS 3193, pp. 335–351, ISBNA Public-Key Encryption Scheme with Pseudo-Random Ciphertex Add to Reading List Source URL: www.bmoeller.de Language: English - Date: 2006-01-02 00:25:23 Public-key cryptography Adaptive chosen-ciphertext attack Elliptic curve cryptography Diffie–Hellman problem Advantage Chosen-ciphertext attack Cipher Key encapsulation Elliptic curve Diffie–Hellman Cryptography Finite fields Ciphertext indistinguishability
27	Two novel applications of bilinear groups to ABE encryption Riccardo Longo Department of Mathematics, University of Trento, Italy Chiara Marcolla Department of Mathema Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2014-12-12 11:38:03 Finite fields Cryptographic protocols Diffie–Hellman problem Pairing-based cryptography Hellman Diffie–Hellman key exchange Discrete logarithm Whitfield Diffie BLS Cryptography Abstract algebra Computational hardness assumptions
28	Strongly Secure Authenticated Key Exchange Protocol Based on Computational Diffie-Hellman Problem Hai Huang and Zhenfu Cao Department of Computer Science and Engineering, Shanghai Jiaotong University, 800 Dongchuan Road, Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2008-11-27 03:18:55 Advantage Adversary model Diffie–Hellman problem Random oracle Cryptography Cryptographic protocols Cryptographic hash functions
29	A Simple Provably Secure Key Exchange Scheme Based on the Learning with Errors Problem Jintai Ding, Xiang Xie, Xiaodong Lin University of Cincinnati Chinese Academy of Sciences Rutgers University Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2014-07-29 14:01:16 Electronic commerce Learning with errors Machine learning XTR Normal distribution Diffie–Hellman key exchange Diffie–Hellman problem RSA Cryptography Cryptographic protocols Finite fields
30	AN OBSERVATION ABOUT VARIATIONS OF THE DIFFIE-HELLMAN ASSUMPTION R. BHASKAR, K. CHANDRASEKARAN, S. LOKAM, P.L. MONTGOMERY, R. VENKATESAN, AND Y. YACOBI Abstract. We generalize the Strong Boneh-Boyen (SBB) signature sche Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2008-12-16 15:26:16 Finite fields Computability theory Alan Turing Turing reduction Reduction Diffie–Hellman problem Theoretical computer science Applied mathematics Computational complexity theory

UPDATE